QLOC: Quorums With Local Reconstruction Codes
نویسندگان
چکیده
In this paper we study the problem of consistency in distributed storage systems relying on erasure coding for efficient fault-tolerance. We propose QLOC - a flexible framework supporting warm data, i.e., data which, while not being very frequently use, nevertheless continues to be accessed reads or writes regularly. builds upon (1) generic family local reconstruction codes with guarantees terms fault-tolerance, recovery from failures and degraded mode operations, can instantiated parameters customized requirements such as overhead reliability dictated by user needs operational environments, (2) quorum-based mechanisms support read-modify-write operations without any underlying atomic primitives, providing deployment choices trading-off concurrency requirements. carry out theoretical analysis code properties, experimentally benchmark performance enforcement mechanisms, demonstrating practicality proposed approach.
منابع مشابه
On Maximally Recoverable Local Reconstruction Codes
In recent years the explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction Codes (LRCs) have emerged as the codes of choice for these applications. An (n, r ,h,a,q)-LRC is a q-ary code, where encoding is as a two stage process. In the first stage, h redundant parity symbols are generate...
متن کاملApproval quorums dominate participation quorums
We study direct democracy with population uncertainty. Voters’ participation is often among the desiderata by the election designer. A participation quorum is a threshold on the fraction of participating voters below which the status quo is kept. We show that participation quorums produce incentive for partisans of the status quo to abstain, with the consequence that the status quo may be kept ...
متن کاملCodes with local decoding procedures
Error correcting codes allow senders to add redundancy to messages, encoding bit strings representing messages into longer bit strings called codewords, in a way that the message can still be recovered even if a fraction of the codeword bits are corrupted. In certain settings however the receiver might not be interested in recovering all the message, but rather seek to quickly recover just a fe...
متن کاملExtending Local Learners with Error-correcting Output Codes Extending Local Learners with Error-correcting Output Codes
Error-correcting output codes (ECOCs) represent classes with a set of output bits, where each bit encodes a binary classiication task corresponding to a unique partition of the classes. Algorithms that use ECOCs learn the function corresponding to each bit, and combine them to generate class predictions. ECOCs can reduce both variance and bias errors for multiclass classiication tasks when the ...
متن کاملQuorums from Diierence Covers
Maekawa considered a simple but suboptimal grid-based quorum generation scheme in which N sites in the network are logically organized in the form of a p N p N grid, and the quorum sets are row-column pairs. Even though the quorum size 2 p N of the grid scheme is twice as large as nite projective plane with optimal sized quorums, it has the advantage of being simple and geometrically evident. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3093450